Chapter 18 FAILURE DISCRIMINATION BY SEMI-DEFINITE PROGRAMMING

نویسندگان

  • Hiroshi Konno
  • Jun-ya Gotoh
  • Stanislav Uryasev
  • Atsushi Yuki
چکیده

This paper addresses itself to a new approach for failure discriminant analysis, a classical and yet very actively studied problem in financial engineering. The basic idea of the new method is to separate multi-dimensional financial data corresponding to ongoing and failed enterprises by an ellipsoidal surface which enjoys a good mathematical property as well as a clear financial interpretation. We will apply a new cutting plane algorithm for solving a resulting semidefinite programming problem and show that it can generate an optimal solution in a much more efficient way than standard interior point algorithms. Computational results using financial data of Japaneseenterprises show that the ellipsoidal separation leads to significantly better results than the hyperplane separation. Also it performs better than the separation by a general quadratic surface, a well used method in support vector machine approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Unambiguous Discrimination of Quantum States

Unambiguously distinguishing between nonorthogonal but linearly independent quantum states is a challenging problem in quantum information processing. In this work, an exact analytic solution to an optimum measurement problem involving an arbitrary number of pure linearly independent quantum states is presented. To this end, the relevant semi-definite programming task is reduced to a linear pro...

متن کامل

Modified Goal Programming Approach for Improving the Discrimination Power and Weights Dispersion

Data envelopment analysis (DEA) is a technique based on linear programming (LP) to measure the relative efficiency of homogeneous units by considering inputs and outputs. The lack of discrimination among efficient decision making units (DMUs) and unrealistic input-outputs weights have been known as the drawback of DEA. In this paper the new scheme based on a goal programming data envelopment an...

متن کامل

Parallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm

This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...

متن کامل

CSC 2411 - Linear Programming and Combinatorial Optimization ∗ Lecture 9 : Semi - Definite Programming Combinatorial Optimization

This lecture consists of two main parts. In the first one, we revisit Semi-Definite Programming (SDP). We show its equivalence to Vector Programming, we prove it has efficient membership and separation oracles and finally state a theorem that shows why Ellipsoid can be used to acquire an approximate solution of a semi-definite program. In the second part, we make a first approach to Combinatori...

متن کامل

Positive Semi-definite Programming Localization in Wireless Sensor Networks

We propose an algorithm to locate an object with unknown coordinates based on the positive semi-definite programming in the wireless sensor networks, assuming that the squared error of the measured distance follows Gaussian distribution. We first obtain the estimator of the object location; then transform the non-convex problem to convex one by the positive semi-definite relaxation; and finally...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002